Irreversible quantum graphs
نویسنده
چکیده
Irreversibility is introduced to quantum graphs by coupling the graphs to a bath of harmonic oscillators. The interaction which is linear in the harmonic oscillator amplitudes is localized at the vertices. It is shown that for sufficiently strong coupling, the spectrum of the system admits a new continuum mode which exists even if the graph is compact, and a single harmonic oscillator is coupled to it. This mechanism is shown to imply that the quantum dynamics is irreversible. Moreover, it demonstrates the surprising result that irreversibility can be introduced by a “bath” which consists of a single harmonic oscillator.
منابع مشابه
On a Mathematical Model of Irreversible Quantum Graphs
The “irreversible quantum graph” model, suggested by U. Smilansky, is considered. Mathematically, the problem is in the investigation of the spectrum of the operator Aα determined by an infinite system of ordinary differential equations on a graph and by a system of boundary conditions, such as conditions on the jumps of derivatives. The operator depends on a parameter α ≥ 0 involved in the bou...
متن کاملSmilansky’s Model of Irreversible Quantum Graphs, Ii: the Point Spectrum
In the model suggested by Smilansky [6] one studies an operator describing the interaction between a quantum graph and a system of K one-dimensional oscillators attached at different points of the graph. This paper is a continuation of [3] in which we started an investigation of the case K > 1. For the sake of simplicity we consider K = 2, but our argument applies to the general situation. In t...
متن کاملSmilansky’s Model of Irreversible Quantum Graphs, I: the Absolutely Continuous Spectrum
In the model suggested by Smilansky [7] one studies an operator describing the interaction between a quantum graph and a system of K one-dimensional oscillators attached at several different points in the graph. The present paper is the first one in which the case K > 1 is investigated. For the sake of simplicity we consider K = 2, but our argument is of a general character. In this first of tw...
متن کاملA Note on Irreversible 2-Conversion Sets in Subcubic Graphs
Irreversible k-conversion set is introduced in connection with the mathematical modeling of the spread of diseases or opinions. We show that the problem to find a minimum irreversible 2-conversion set can be solved in O(n2 log6 n) time for graphs with maximum degree at most 3 (subcubic graphs) by reducing it to the graphic matroid parity problem, where n is the number of vertices in a graph. Th...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کامل